Computing Dual Time Scale Dynamic User Equilibria
نویسندگان
چکیده
In this paper we summarize a dual-time scale formulation of dynamic user equilibrium with demand growth due to Friesz et al (2008). This formulation belongs to the problem class that Pang and Stewart (2008) refer to as di¤erential variational inequalities. We also present a xed point algorithm for computing solutions to the dual time-scale model without calculating derivatives, along with a numerical example. Keywords: dynamic user equilibrium, di¤erential variational inequalities, xed point algorithm, dual time scale
منابع مشابه
A context-sensitive dynamic role-based access control model for pervasive computing environments
Resources and services are accessible in pervasive computing environments from anywhere and at any time. Also, due to ever-changing nature of such environments, the identity of users is unknown. However, users must be able to access the required resources based on their contexts. These and other similar complexities necessitate dynamic and context-aware access control models for such environmen...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملA social recommender system based on matrix factorization considering dynamics of user preferences
With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...
متن کاملOn Self Adaptive Routing in Dynamic Environments
Recently we have seen an emergent trend of self adaptive routing in both Internet and wireless ad hoc networks. Although there are previous methods for computing the traffic equilibria of self adaptive routing (e.g., selfish routing), these methods use computationally demanding algorithms and require that a precise analytical model of the network be given. Also, it remains an open question how ...
متن کاملComputing Pure Nash Equilibria in Symmetric Action Graph Games
We analyze the problem of computing pure Nash equilibria in action graph games (AGGs), which are a compact gametheoretic representation. While the problem is NP-complete in general, for certain classes of AGGs there exist polynomial time algorithms. We propose a dynamic-programming approach that constructs equilibria of the game from equilibria of restricted games played on subgraphs of the act...
متن کامل